Making Dynamic Memory Allocation Static to Support Wcet Analyses1
نویسندگان
چکیده
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictable cache performance when standard memory allocators are used. We present algorithms to compute a static allocation for programs using dynamic memory allocation. Our algorithms strive to produce static allocations that lead to minimal WCET times in a subsequent WCET analyses. Preliminary experiments suggest that static allocations for hard real-time applications can be computed at reasonable computational costs.
منابع مشابه
CAMA - Cache-Aware Memory Allocation for WCET Analysis
Current WCET analyses do not support dynamic memory allocation. This is mainly due to the unpredictability of the cache performance if standard memory allocators are used. We present a novel dynamic memory allocator that makes cache performance predictable and (de)allocates memory in constant time. It thereby enables WCET analysis in the presence of dynamic memory allocation.
متن کاملPrecomputing Memory Locations for Parametric Allocations
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static allocations for dynamically allocating programs with known numeric bounds on the number and sizes of allo...
متن کاملPrecomputing Memory Locations for Parametric Allocations1
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduced by standard memory allocators. To overcome this problem, algorithms have been proposed that precompute static allocations for dynamically allocating programs with known numeric bounds on the number and sizes of allo...
متن کاملAn algorithm with constant execution time for dynamic storage allocation
The predictability of the computation t ime of program modules is very important f o r estimating an accurate worst-case execution t ime ( W C E T ) of a task in real-time systems. Dynamic storage allocation ( D S A ) is a common programming technique. Although many DSA algorithms have been developed, they focus o n the average execution t ime rather than the W C E T , making it is very dif icu...
متن کاملPRADA: Predictable Allocations by Deferred Actions
Modern hard real-time systems still employ static memory management. However, dynamic storage allocation (DSA) can improve the flexibility and readability of programs as well as drastically shorten their development times. But allocators introduce unpredictability that makes deriving tight bounds on an application’s worst-case execution time even more challenging. Especially their statically un...
متن کامل